Logics of Infinite Depth

نویسنده

  • Marcus Kracht
چکیده

Consider a definition of depth of a logic as the supremum of ordinal types of wellordered descending chains. This extends the usual definition of codimension to infinite depths. Logics may either have no depth, or have countable depth in case a maximal well-ordered chain exists, or be of depth !1. We shall exhibit logics of all three types. We show in particular that many well-known systems, among them K, K4, G, Grz and S4, have depth !1. Basically, if a logic is the intersection of its splitting logics and has finite model property, then either the splitting logics have an infinite antichain (and the depth is therefore !1) or the splitting logics form a well-partial order whose supremum type is realised and therefore countable, though it may be di↵erent from the supremum type of the splitting logics alone.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Substitution Frege and extended Frege proof systems in non-classical logics

We investigate the substitution Frege (SF ) proof system and its relationship to extended Frege (EF ) in the context of modal and superintuitionistic (si) propositional logics. We show that EF is p-equivalent to tree-like SF , and we develop a “normal form” for SF proofs. We establish connections between SF for a logic L, and EF for certain bimodal expansions of L. We then turn attention to spe...

متن کامل

Non-finitely axiomatisable two-dimensional modal logics

We show the first examples of recursively enumerable (even decidable) two-dimensional products of finitely axiomatisable modal logics that are not finitely axiomatisable. In particular, we show that any axiomatisation of some bimodal logics that are determined by classes of product frames with linearly ordered first components must be infinite in two senses: It should contain infinitely many pr...

متن کامل

A polynomial space construction of tree-like models for logics with local chains of modal connectives

The LA-logics (“logics with Local Agreement”) are polymodal logics defined semantically such that at any world of a model, the sets of successors for the different accessibility relations can be linearly ordered and the accessibility relations are equivalence relations. In a previous work, we have shown that every LA-logic defined with a finite set of modal indices has an NP-complete satisfiabi...

متن کامل

Expressive Equivalence of Least and Inflationary Fixed-Point Logic

We study the relationship between least and inflationary fixed-point logic. By results of Gurevich and Shelah from 1986, it has been known that on finite structures both logics have the same expressive power. On infinite structures however, the question whether there is a formula in IFP not equivalent to any LFP-formula was still open. In this paper, we settle the question by showing that both ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016